Comparison of inequalities for the minimax series via Tchebychev polynomials
نویسندگان
چکیده
In this paper several remarkable inequalities for the product with minimax series are considered and are compared via the valuation of these inequalities on Tchebyshev’s polynomials. c © 1998 Elsevier Science B.V. All rights reserved.
منابع مشابه
Orthogonalizing Weights of Tchebychev Sets of Polynomials
We characterize distributions with respect to which the members of a Tchebychev set of polynomials are orthogonal when they satisfy differential equations with polynomial coefficients. As an application, we find a real weight of bounded variation with support in [0, oo) for Bessel polynomials.
متن کاملCertain Combinatorial Identities of Twin Pairs Related to Tchebychev Polynomials
In the present paper, a twin pair (xn, yn) and (Xn, Yn) of numbers related to one and two variable Tchebychev polynomials of first and second kinds are proposed. Certain Combinatorial Identities of the twin pairs are stated and proved.
متن کاملNumerical solution of nonlinear Fredholm-Volterra integral equations via Bell polynomials
In this paper, we propose and analyze an efficient matrix method based on Bell polynomials for numerically solving nonlinear Fredholm- Volterra integral equations. For this aim, first we calculate operational matrix of integration and product based on Bell polynomials. By using these matrices, nonlinear Fredholm-Volterra integral equations reduce to the system of nonlinear algebraic equations w...
متن کاملSome compact generalization of inequalities for polynomials with prescribed zeros
Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$. In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$, $k^2 leq rRleq R^2$ and for $Rleq r leq k$. Our results refine and generalize certain well-known polynomial inequalities.
متن کاملError of Truncated Chebyshev Series and Other Near Minimax Polynomial Approximations
It is well known that a near minimax polynomial approximation p is obtained by truncating the Chebyshev series of a function fafter n + 1 terms. It is shown that if /'E C' " + " [-1, I], then 1I.f-pII may be expressed in terms off' " ' I) in the same manner as the error of minimax approximation. The result is extended to other types of near minimax approximation.
متن کامل